The two-point function of bicolored planar maps
نویسندگان
چکیده
We compute the distance-dependent two-point function of vertex-bicolored planar maps, i.e., maps whose vertices are colored in black and white so that no adjacent vertices have the same color. By distance-dependent two-point function, we mean the generating function of these maps with both a marked oriented edge and a marked vertex which are at a prescribed distance from each other. As customary, the maps are enumerated with arbitrary degree-dependent face weights, but the novelty here is that we also introduce color-dependent vertex weights. Explicit expressions are given for vertexbicolored maps with bounded face degrees in the form of ratios of determinants of fixed size. Our approach is based on a slice decomposition of maps which relates the distancedependent two-point function to the coefficients of the continued fraction expansions of some distance-independent map generating functions. Special attention is paid to the case of vertex-bicolored quadrangulations and hexangulations, whose two-point functions are also obtained in a more direct way involving equivalences with hard dimer statistics. A few consequences of our results, as well as some extension to vertex-tricolored maps, are also discussed.
منابع مشابه
Enumerative Formulae for Unrooted Planar Maps: a Pattern
We present uniformly available simple enumerative formulae for unrooted planar n-edge maps (counted up to orientation-preserving isomorphism) of numerous classes including arbitrary, loopless, non-separable, eulerian maps and plane trees. All the formulae conform to a certain pattern with respect to the terms of the sum over t | n, t < n. Namely, these terms, which correspond to non-trivial aut...
متن کاملA Bijection for Unicellular Partitioned Bicolored Maps
In the present paper we construct a bijection that relates a set CN,p,q of unicellular partitioned bicolored maps to a set of couples (t, σ) of ordered bicolored trees and partial permutations. This bijection allows us to derive an elegant formula for the enumeration of unicellular bicolored maps, an analogue of the well-known Harer-Zagier result for unicolored one-face maps. Résumé. Dans cet a...
متن کاملA bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n white and m black vertices, have been enumerated independantly by Jackson and Adrianov using evaluations of characters of the symmetric group. In this paper we present a bijection between unicellular partitioned bicolored ...
متن کاملThe Three-point Function of General Planar Maps
We compute the distance-dependent three-point function of general planar maps and of bipartite planar maps, i.e., the generating function of these maps with three marked vertices at prescribed pairwise distances. Explicit expressions are given for maps counted by their number of edges only, or by both their numbers of edges and faces. A few limiting cases and applications are discussed.
متن کاملEnumeration of planar constellations
The enumeration of transitive ordered factorizations of a given permutation is a combinatorial problem related to singularity theory. Let n > 1, m > 2, and let 0 be a permutation of Sn having di cycles of length i, for i > 1. We prove that the number of m-tuples (1 ; : : : ; m) of permutations of Sn such that: A one-to-one correspondence relates these m-tuples to some rooted planar maps, which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014